Rational Dynamics and Epistemic Logic in Games

نویسنده

  • Johan van Benthem
چکیده

I propose a bare-bones look at epistemic models for games, with a focus on update procedures for reaching equilibrium 'zones'. Connections are given with standard update and fixedpoint logics. This is just a 'methods' paper, as readers will want to play with models, uncertainty relations, and announcements different from those used here for the purposes of illustration. 1 Reaching equilibrium Nash equilibrium describes optimal strategy profiles for players of a game. But it has some well-known problems, where predicted equilibria do not match most plausible behaviour. Examples arise both in strategic games such as Prisoner's Dilemma, and extensive ones such as the Centipede (cf. Binmore 1992, Osborne & Rubinstein 1994). One important line of analysis tries to analyze this situation by identifying suitable epistemic assertions about players' behaviour which imply the usual equilibrium solutions. For this purpose, game theorists have introduced epistemic models for a given game, representing what players know and do not know about possible strategy profiles – plus perhaps other features of the game, its players, and its environment. One such type of behaviour is rationality: choosing one's best available response to the action profile of the other players. And common knowledge of rationality is taken to imply the Nash equilibrium solution concept for strategic games, and suitably formulated, also the backward induction solution for extensive games. This Note takes a closer look at the logic of the implication from rationality to equilibrium. In this first part, we focus on strategic games, where players choose one action each, simultaneously – as in the familiar 2-player game matrices. There may be a second part later. The main thrust of what follows is a familiar point of 'logical dynamics'. In addition to the standard static notion of equilibrium, game-theoretic intuitions seem to be just as much about dynamic procedures that produce equilibria. E.g., in Iterated Removal of Dominated Strategies for strategic games, or Backward Induction for extensive games, equilibrium arises as a fixed-point of some process

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Epistemic Games in Modal Logic: Joint Actions, Knowledge and Preferences all together

We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and enabling to reason about epistemic games in strategic form. We provide complexity results for EDLA. In the second part of the paper, we study in EDLA the epistemic and rationality conditions of some classical solution con...

متن کامل

Epistemic Game Theory and Logic: Introduction

Epistemic game theory and the systems of logic that support it are crucial for understanding rational behavior in interactive situations in which the outcome for an agent depends, not just on her own behavior, but also on the behavior of those with whom she is interacting. Scholars in many fields study such interactive situations, that is, games of strategy. Epistemic game theory presents the e...

متن کامل

Coalitional Public Announcement Games

Dynamic epistemic logic (DEL) is a popular framework for studying interaction in multi-agent systems. DELs describe the actions available to the agents, and their epistemic preand post-conditions. By extending standard epistemic models with preferences over epistemic states, we can say something about rational behaviour as well, combining logic and game theory. In this paper we assume that pref...

متن کامل

What will they say? - Public Announcement Games

Dynamic epistemic logics describe the epistemic consequences of actions. Public announcement logic, in particular, describe the consequences of public announcements. As such, these logics are descriptive – they describe what agents can do. In this paper we discuss what rational agents will or should do. We consider situations where each agent has a goal, a typically epistemic formula he or she ...

متن کامل

Investigation and Model checking of Algorithms of Eliminations in Game Theory based on Dynamic Epistemic Logic

The core of game theory is looking for the solution of game problems. Various algorithms of iterated elimination are significant for the rapid reduction of game models and seeking reasonable Nash equilibria. The traditional framework of game analysis assumes that game players are Bayesian rational, and that "every player is rational" is common knowledge among the players. However, game theory i...

متن کامل

What will they say? – Public Announcement Games

Dynamic epistemic logic describes the possible information-changing actions available to individual agents, and their knowledge preand post conditions. For example, public announcement logic describes actions in the form of public, truthful announcements. However, little research so far has considered describing and analysing rational choice between such actions, i.e., predicting what rational ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IGTR

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2007